Semantic Schema Matching
نویسندگان
چکیده
We view match as an operator that takes two graph-like structures (e.g., XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each other. Semantic schema matching is based on the two ideas: (i) we discover mappings by computing semantic relations (e.g., equivalence, more general); (ii) we determine semantic relations by analyzing the meaning (concepts, not labels) which is codified in the elements and the structures of schemas. In this paper we present basic and optimized algorithms for semantic schema matching, and we discuss their implementation within the S-Match system. We also validate the approach and evaluate S-Match against three state of the art matching systems. The results look promising, in particular for what concerns quality and performance.
منابع مشابه
An Improved Semantic Schema Matching Approach
Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...
متن کاملFormalizing the XML Schema Matching Problem as a Constraint Optimization Problem
The first step in finding an efficient way to solve any difficult problem is making a complete, possibly formal, problem specification. This paper introduces a formal specification for the problem of semantic XML schema matching . Semantic schema matching has been extensively researched, and many matching systems have been developed. However, formal specifications of problems being solved by th...
متن کاملA Classification of Schema-Based Matching Approaches
Schema/ontology matching is a critical problem in many application domains, such as, semantic web, schema/ontology integration, data warehouses, e-commerce, catalog matching, etc. Many diverse solutions to the matching problem have been proposed so far. In this paper we present a taxonomy of schema-based matching techniques that builds on the previous work on classifying schema matching approac...
متن کاملSchema-based Semantic Matching: Algorithms, a System and a Testing Methodology PhD Thesis Proposal
Schema/ontology/classification matching is a critical problem in many application domains, such as, schema/ontology/classification integration, data warehouses, e-commerce, web services coordination, Semantic Web, semantic query processing, etc. We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes. Semantic matching is ...
متن کاملA Survey of Schema-Based Matching Approaches
Schema and ontology matching is a critical problem in many application domains, such as semantic web, schema/ontology integration, data warehouses, e-commerce, etc. Many different matching solutions have been proposed so far. In this paper we present a new classification of schema-based matching techniques that builds on the top of state of the art in both schema and ontology matching. Some inn...
متن کاملDefining the XML Schema Matching Problem for a Personal Schema Based Query Answering System
3 A framework for defining a schema matching problem 6 3.1 Modeling XML schemas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.1.1 Features of the XML schema language . . . . . . . . . . . . . . . . . . . . . 7 3.1.2 Graph theory basics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.1.3 XML schema graph . . . . . . . . . . . . . . . . . . . . . . . . . ...
متن کامل